Dominating set

Results: 145



#Item
31Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Förster ETH Zurich – Distributed Computing – www.disco.ethz.ch

Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Förster ETH Zurich – Distributed Computing – www.disco.ethz.ch

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2015-05-18 12:16:33
32Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to

Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2015-05-18 12:16:23
33A new characterization of Pk -free graphs Eglantine Camby Universit´e Libre de Bruxelles D´epartement de Math´ematique Boulevard du Triomphe, 1050 Brussels, Belgium

A new characterization of Pk -free graphs Eglantine Camby Universit´e Libre de Bruxelles D´epartement de Math´ematique Boulevard du Triomphe, 1050 Brussels, Belgium

Add to Reading List

Source URL: www.zaik.uni-koeln.de

Language: English - Date: 2015-02-09 05:54:36
34On Approximation Complexity of Edge Dominating Set Problem in Dense Graphs Richard Schmied∗ Claus Viehmann†

On Approximation Complexity of Edge Dominating Set Problem in Dense Graphs Richard Schmied∗ Claus Viehmann†

Add to Reading List

Source URL: theory.cs.uni-bonn.de

Language: English - Date: 2011-06-03 08:54:09
    35Hitting Set Algorithms for Fast Data Recovery in the Face of Geographic Correlated Attacks Alon Efrat Esther Ezra

    Hitting Set Algorithms for Fast Data Recovery in the Face of Geographic Correlated Attacks Alon Efrat Esther Ezra

    Add to Reading List

    Source URL: www.cims.nyu.edu

    Language: English - Date: 2013-07-29 14:22:26
    36Seminar on Algorithms and Geometry 2014B – Problem Set 3 Robert Krauthgamer May 15, 2014 We discussed in class low-distortion metric embeddings, and in particular a probabilistic embedding into dominating trees.

    Seminar on Algorithms and Geometry 2014B – Problem Set 3 Robert Krauthgamer May 15, 2014 We discussed in class low-distortion metric embeddings, and in particular a probabilistic embedding into dominating trees.

    Add to Reading List

    Source URL: www.wisdom.weizmann.ac.il

    - Date: 2014-05-15 11:57:38
      37An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗ ‡ Michel X. Goemans†

      An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗ ‡ Michel X. Goemans†

      Add to Reading List

      Source URL: www.stanford.edu

      Language: English - Date: 2009-10-28 12:34:47
      38Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein1 , Claire Mathieu2,3 , and Hang Zhou3 1 Brown University, United States

      Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein1 , Claire Mathieu2,3 , and Hang Zhou3 1 Brown University, United States

      Add to Reading List

      Source URL: www.normalesup.org

      Language: English - Date: 2015-03-16 13:08:36
      39Local Distributed Decision∗ Pierre Fraigniaud† Amos Korman† David Peleg‡

      Local Distributed Decision∗ Pierre Fraigniaud† Amos Korman† David Peleg‡

      Add to Reading List

      Source URL: www.liafa.jussieu.fr

      Language: English - Date: 2011-10-30 17:16:12
      40Better bounds for matchings in the streaming model Michael Kapralov∗ arXiv:1206.2269v2 [cs.DS] 26 JulDecember 6, 2013

      Better bounds for matchings in the streaming model Michael Kapralov∗ arXiv:1206.2269v2 [cs.DS] 26 JulDecember 6, 2013

      Add to Reading List

      Source URL: arxiv.org

      Language: English - Date: 2013-12-06 12:53:09